Non-backtracking walks reveal compartments in sparse chromatin interaction networks
نویسندگان
چکیده
منابع مشابه
Cutoff for non-backtracking random walks on sparse random graphs
Reduced `-cohomology in degree 1 (for short "LpR1") is a useful quasiisometry invariant of graphs [of bounded valency] whose definition is relatively simple. On a graph, there is a natural gradient operator from functions to vertices to functions on edges defined by looking at the difference of the value on the extremities of the edge. Simply put, this cohomology is the quotient of functions wi...
متن کاملPoisson approximation for non-backtracking random walks
Random walks on expander graphs were thoroughly studied, with the important motivation that, under some natural conditions, these walks mix quickly and provide an efficient method of sampling the vertices of a graph. The authors of [3] studied non-backtracking random walks on regular graphs, and showed that their mixing rate may be up to twice as fast as that of the simple random walk. As an ap...
متن کاملFaster Clustering via Non-Backtracking Random Walks
This paper presents VEC-NBT, a variation on the unsupervised graph clustering technique VEC, which improves upon the performance of the original algorithm significantly for sparse graphs. VEC employs a novel application of the state-ofthe-art word2vec model to embed a graph in Euclidean space via random walks on the nodes of the graph. In VEC-NBT, we modify the original algorithm to use a non-b...
متن کاملNon-backtracking random walks mix faster
We compute the mixing rate of a non-backtracking random walk on a regular expander. Using some properties of Chebyshev polynomials of the second kind, we show that this rate may be up to twice as fast as the mixing rate of the simple random walk. The closer the expander is to a Ramanujan graph, the higher the ratio between the above two mixing rates is. As an application, we show that if G is a...
متن کامل7 Random Matrices , Non - Backtracking Walks , and Orthogonal Polynomials
Several well-known results from the random matrix theory, such as Wigner’s law and the Marchenko–Pastur law, can be interpreted (and proved) in terms of non-backtracking walks on a certain graph. Orthogonal polynomials with respect to the limiting spectral measure play a rôle in this approach.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Reports
سال: 2020
ISSN: 2045-2322
DOI: 10.1038/s41598-020-68182-0